Vectorization and Parallelization of Clustering Algorithms
نویسندگان
چکیده
In this work we present a study on the parallelization of code segments that are typical of clustering algorithms. In order to approach this problem from a practical point of view we have considered the parallelization on the three types of architectures currently available from parallel system manufacturers: vector computers, shared memory multiprocessors and distributed memory multicomputers. We have selected the FC (Fuzzy Covariance) and AD (AAnity Decompositions) algorithms as representative of the diierent computational structures found in clustering algorithms. We present a comparative study of the results obtained from running these algorithms on three systems: VP2400/10, KSR-1 and AP1000.
منابع مشابه
Parallel Deterministic Solution of the Boltzmann Transport Equation for Semiconductors
Clock frequencies and hence single-threaded processing power of modern processors have saturated because of power constraints. As a consequence, the overall processing power in modern processors mostly stems from parallelization and vectorization. However, parallel processors can only be used efficiently with suitable parallel algorithms. Unfortunately, the design and implementation of such par...
متن کاملPartition Around Medoids Clustering on the Intel Xeon Phi Many-Core Coprocessor
The paper touches upon the problem of implementation Partition Around Medoids (PAM) clustering algorithm for the Intel Many Integrated Core architecture. PAM is a form of well-known k-Medoids clustering algorithm and is applied in various subject domains, e.g. bioinformatics, text analysis, intelligent transportation systems, etc. An optimized version of PAM for the Intel Xeon Phi coprocessor i...
متن کاملMultibillion-atom molecular dynamics simulation: Design considerations for vector-parallel processing
Progress in adapting molecular dynamics algorithms for systems with short-range interactions to utilize the features of modern supercomputers is described. Efficient utilization of the latest generation of processor architectures requires algorithms that can be both vectorized and parallelized. The approach adopted for vectorization involves combining the layer and neighbor-list methods, while ...
متن کاملShort-Vector SIMD Parallelization in Signal Processing
Short-vector Single-instruction-multiple-data (SIMD) units have become common in signal processors. Moreover, almost all modern general-purpose processors include SIMD extensions, which makes SIMD also important in high performance computing. This chapter gives an overview of approaches to the vectorization of signal processing algorithms. Despite their complexity, these algorithms have a relat...
متن کاملGPU Parallelization for Unstructured Sparse Matrix Problems with OpenMP 4.5 and OpenACC
The effective use of parallelized hardware is an important goal of today’s computer developments. Nvidia GPUs are an important footing in this context. While CUDA implemented algorithms focus on detailed optimized usage of GPU elements the pragma directive parallelization targets GPU computation for a broader community. In this paper we focus on the implementation of OpenACC and OpenMP 4.5 para...
متن کامل